Odd gossiping

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trade-oos for Odd Gossiping

In the gossiping problem, each node of a network starts with a unique piece of information and must acquire the information of all the other nodes. This is done using two-way communications between pairs of nodes. In this paper, we consider gossiping in n-node networks with n odd, where we use a linear cost model, in which the cost of communication is proportional to the amount of information t...

متن کامل

Gossiping Capabilities

Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HEterogeneity-Aware Gossip Protocol, where nodes dynamically adjust their contribution to gossip dissemination according to their capabilities....

متن کامل

Gossiping in circulant graphs Gossiping in circulant graphs

ENG) We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperime...

متن کامل

Clique Gossiping

This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques. Clique-gossip protocols are defined as arbitrary linear node interactions where node states are vectors evolving as lin...

متن کامل

Semantic Gossiping

We state that the problem of semantic interoperability in information search on the Internet is solved today mostly by means of centralization, both at a system and at a logical level. A new brand of system architectures, peerto-peer systems, indicates that the principle of decentralization might lead to solutions to many problems that scale well to very large numbers of users. In this position...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2017

ISSN: 0166-218X

DOI: 10.1016/j.dam.2016.01.034